Tribute to Gunnar Jacks (*April 13, 1937 †September 18, 2019)

Cover Vol 16, No. 2, April 2019

Lecture 18 – April 11 , 2016

An easy example of a concept class is the set of emails and functions mapping emails to spam or not spam. Another example is the set of points and a line `, and a single function determining which side of the line ` the points are on. PAC learning is the following problem. We are given a concept class H, a function f ∈ H, and a hidden distribution D on X. The algorithm is allowed to get m label...

of April 13 , 2017 . This

of April 13 , 2017 . This

Lecture 12 : April 13 , 2017

Last Time During the last lecture we completed an argument for a 2 1 d−1 ) lower bound for depth-d circuits for parity (PAR) using Hastad’s Switching Lemma [H̊as87], which stated that, for f : {0, 1} → {−1, 1}, if CNFwidth(f) = t, Pρ←Rp(DNFwidth(f ρ) = s) ≥ (7ps) We proved the Weak Switching Lemma, asserting a (40ps2) lower bound for this probability as opposed to the tighter bound given by the ...